0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM
0.12/0.33	% Computer : n023.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1920
0.12/0.33	% WCLimit    : 240
0.12/0.33	% DateTime   : Wed Jul 30 03:41:04 EDT 2025
0.12/0.34	% CPUTime    : 
0.21/0.47	Running higher-order theorem proving
0.21/0.48	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.s4JSg4HlC9/E---3.1_15887.p
0.21/0.51	# Version: 3.0.0-ho
0.21/0.51	# Preprocessing class: HSMSSMSSMLLNHSN.
0.21/0.51	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.21/0.51	# Starting new_ho_10_cnf2 with 1200s (5) cores
0.21/0.51	# Starting post_as_ho3 with 240s (1) cores
0.21/0.51	# Starting new_ho_12 with 240s (1) cores
0.21/0.51	# Starting new_bool_2 with 240s (1) cores
0.21/0.51	# new_ho_10_cnf2 with pid 15965 completed with status 0
0.21/0.51	# Result found by new_ho_10_cnf2
0.21/0.51	# Preprocessing class: HSMSSMSSMLLNHSN.
0.21/0.51	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.21/0.51	# Starting new_ho_10_cnf2 with 1200s (5) cores
0.21/0.51	# No SInE strategy applied
0.21/0.51	# Search class: HGUNM-FFMF32-SHSSMFNN
0.21/0.51	# Scheduled 6 strats onto 5 cores with 1200 seconds (1200 total)
0.21/0.51	# Starting new_ho_10 with 649s (1) cores
0.21/0.51	# Starting new_ho_10_cnf2 with 121s (1) cores
0.21/0.51	# Starting ehoh_best_sine_rwall with 109s (1) cores
0.21/0.51	# Starting lpo1_def_fix with 109s (1) cores
0.21/0.51	# Starting ehoh_best8_lambda with 109s (1) cores
0.21/0.51	# ehoh_best_sine_rwall with pid 15976 completed with status 0
0.21/0.51	# Result found by ehoh_best_sine_rwall
0.21/0.51	# Preprocessing class: HSMSSMSSMLLNHSN.
0.21/0.51	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.21/0.51	# Starting new_ho_10_cnf2 with 1200s (5) cores
0.21/0.51	# No SInE strategy applied
0.21/0.51	# Search class: HGUNM-FFMF32-SHSSMFNN
0.21/0.51	# Scheduled 6 strats onto 5 cores with 1200 seconds (1200 total)
0.21/0.51	# Starting new_ho_10 with 649s (1) cores
0.21/0.51	# Starting new_ho_10_cnf2 with 121s (1) cores
0.21/0.51	# Starting ehoh_best_sine_rwall with 109s (1) cores
0.21/0.51	# Preprocessing time       : 0.002 s
0.21/0.51	# Presaturation interreduction done
0.21/0.51	
0.21/0.51	# Proof found!
0.21/0.51	# SZS status Theorem
0.21/0.51	# SZS output start CNFRefutation
0.21/0.51	thf(decl_sort1, type, mu: $tType).
0.21/0.51	thf(decl_25, type, mnot: ($i > $o) > $i > $o).
0.21/0.51	thf(decl_26, type, mor: ($i > $o) > ($i > $o) > $i > $o).
0.21/0.51	thf(decl_28, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
0.21/0.51	thf(decl_32, type, mforall_ind: (mu > $i > $o) > $i > $o).
0.21/0.51	thf(decl_34, type, mexists_ind: (mu > $i > $o) > $i > $o).
0.21/0.51	thf(decl_38, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
0.21/0.51	thf(decl_39, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
0.21/0.51	thf(decl_41, type, msymmetric: ($i > $i > $o) > $o).
0.21/0.51	thf(decl_50, type, mvalid: ($i > $o) > $o).
0.21/0.51	thf(decl_54, type, a1: $i > $i > $o).
0.21/0.51	thf(decl_58, type, piotr: mu).
0.21/0.51	thf(decl_61, type, beer: mu).
0.21/0.51	thf(decl_62, type, likes: mu > mu > $i > $o).
0.21/0.51	thf(decl_64, type, possibly_likes: mu > mu > $i > $o).
0.21/0.51	thf(decl_68, type, esk2_0: $i).
0.21/0.51	thf(decl_72, type, esk6_1: $i > $i).
0.21/0.51	thf(mdia, axiom, ((mdia)=(^[X13:$i > $i > $o, X6:$i > $o]:(mnot @ (mbox @ X13 @ (mnot @ X6))))), file('/export/starexec/sandbox2/tmp/tmp.s4JSg4HlC9/E---3.1_15887.p', mdia)).
0.21/0.51	thf(mnot, axiom, ((mnot)=(^[X6:$i > $o, X3:$i]:(~((X6 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.s4JSg4HlC9/E---3.1_15887.p', mnot)).
0.21/0.51	thf(mbox, axiom, ((mbox)=(^[X13:$i > $i > $o, X6:$i > $o, X3:$i]:(![X14:$i]:((~((X13 @ X3 @ X14))|(X6 @ X14)))))), file('/export/starexec/sandbox2/tmp/tmp.s4JSg4HlC9/E---3.1_15887.p', mbox)).
0.21/0.51	thf(msymmetric, axiom, ((msymmetric)=(^[X13:$i > $i > $o]:(![X15:$i, X16:$i]:(((X13 @ X15 @ X16)=>(X13 @ X16 @ X15)))))), file('/export/starexec/sandbox2/tmp/tmp.s4JSg4HlC9/E---3.1_15887.p', msymmetric)).
0.21/0.51	thf(mvalid, axiom, ((mvalid)=(^[X6:$i > $o]:(![X3:$i]:((X6 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.s4JSg4HlC9/E---3.1_15887.p', mvalid)).
0.21/0.51	thf(mimplies, axiom, ((mimplies)=(^[X6:$i > $o, X7:$i > $o]:(mor @ (mnot @ X6) @ X7))), file('/export/starexec/sandbox2/tmp/tmp.s4JSg4HlC9/E---3.1_15887.p', mimplies)).
0.21/0.51	thf(mor, axiom, ((mor)=(^[X6:$i > $o, X7:$i > $o, X3:$i]:(((X6 @ X3)|(X7 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.s4JSg4HlC9/E---3.1_15887.p', mor)).
0.21/0.51	thf(axioms_B_a1, axiom, (msymmetric @ a1), file('/export/starexec/sandbox2/tmp/tmp.s4JSg4HlC9/E---3.1_15887.p', axioms_B_a1)).
0.21/0.51	thf(axiom_a3_3, axiom, (mvalid @ (mdia @ a1 @ (likes @ piotr @ beer))), file('/export/starexec/sandbox2/tmp/tmp.s4JSg4HlC9/E---3.1_15887.p', axiom_a3_3)).
0.21/0.51	thf(mforall_ind, axiom, ((mforall_ind)=(^[X8:mu > $i > $o, X3:$i]:(![X1:mu]:((X8 @ X1 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.s4JSg4HlC9/E---3.1_15887.p', mforall_ind)).
0.21/0.51	thf(axiom_a2_3, axiom, (mvalid @ (mbox @ a1 @ (likes @ piotr @ beer))), file('/export/starexec/sandbox2/tmp/tmp.s4JSg4HlC9/E---3.1_15887.p', axiom_a2_3)).
0.21/0.51	thf(mexists_ind, axiom, ((mexists_ind)=(^[X11:mu > $i > $o]:(mnot @ (mforall_ind @ (^[X1:mu]:(mnot @ (X11 @ X1))))))), file('/export/starexec/sandbox2/tmp/tmp.s4JSg4HlC9/E---3.1_15887.p', mexists_ind)).
0.21/0.51	thf(axiom_user_communication_3, axiom, (mvalid @ (mforall_ind @ (^[X1:mu]:(mforall_ind @ (^[X2:mu]:(mimplies @ (mdia @ a1 @ (likes @ X1 @ X2)) @ (possibly_likes @ X1 @ X2))))))), file('/export/starexec/sandbox2/tmp/tmp.s4JSg4HlC9/E---3.1_15887.p', axiom_user_communication_3)).
0.21/0.51	thf(conj, conjecture, (mvalid @ (mexists_ind @ (^[X1:mu]:(mexists_ind @ (^[X2:mu]:(possibly_likes @ X1 @ X2)))))), file('/export/starexec/sandbox2/tmp/tmp.s4JSg4HlC9/E---3.1_15887.p', conj)).
0.21/0.51	thf(c_0_14, plain, ((mdia)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i > $o, Z2:$i]:(~((![X24:$i]:((~((Z0 @ Z2 @ X24))|(~((Z1 @ X24)))))))))), inference(fof_simplification,[status(thm)],[mdia])).
0.21/0.51	thf(c_0_15, plain, ((mnot)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])).
0.21/0.51	thf(c_0_16, plain, ((mbox)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i > $o, Z2:$i]:(![X14:$i]:((~((Z0 @ Z2 @ X14))|(Z1 @ X14)))))), inference(fof_simplification,[status(thm)],[mbox])).
0.21/0.51	thf(c_0_17, plain, ((msymmetric)=(^[Z0/* 6 */:$i > $i > $o]:(![X15:$i, X16:$i]:(((Z0 @ X15 @ X16)=>(Z0 @ X16 @ X15)))))), inference(fof_simplification,[status(thm)],[msymmetric])).
0.21/0.51	thf(c_0_18, plain, ((mdia)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i > $o, Z2:$i]:(~((![X24:$i]:((~((Z0 @ Z2 @ X24))|(~((Z1 @ X24)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14, c_0_15]), c_0_16])).
0.21/0.51	thf(c_0_19, plain, ((mvalid)=(^[Z0/* 6 */:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])).
0.21/0.51	thf(c_0_20, plain, ((mimplies)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])).
0.21/0.51	thf(c_0_21, plain, ((mor)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])).
0.21/0.51	thf(c_0_22, plain, ![X98:$i, X99:$i]:(((a1 @ X98 @ X99)=>(a1 @ X99 @ X98))), inference(apply_def,[status(thm)],[axioms_B_a1, c_0_17])).
0.21/0.51	thf(c_0_23, plain, ![X115:$i]:(~(![X114:$i]:((~(a1 @ X115 @ X114)|~(likes @ piotr @ beer @ X114))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_a3_3, c_0_18]), c_0_19])])).
0.21/0.51	thf(c_0_24, plain, ((mimplies)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20, c_0_15]), c_0_21])).
0.21/0.51	thf(c_0_25, plain, ((mforall_ind)=(^[Z0/* 19 */:mu > $i > $o, Z1:$i]:(![X1:mu]:((Z0 @ X1 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_ind])).
0.21/0.51	thf(c_0_26, plain, ![X127:$i, X126:$i]:((~(a1 @ X127 @ X126)|(likes @ piotr @ beer @ X126))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_a2_3, c_0_16]), c_0_19])])).
0.21/0.51	thf(c_0_27, plain, ![X211:$i, X212:$i]:((~(a1 @ X211 @ X212)|(a1 @ X212 @ X211))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])).
0.21/0.51	thf(c_0_28, plain, ![X227:$i]:(((a1 @ X227 @ (esk6_1 @ X227))&(likes @ piotr @ beer @ (esk6_1 @ X227)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])).
0.21/0.51	thf(c_0_29, plain, ((mexists_ind)=(^[Z0/* 19 */:mu > $i > $o, Z1:$i]:(~((![X22:mu]:((~((Z0 @ X22 @ Z1))))))))), inference(fof_simplification,[status(thm)],[mexists_ind])).
0.21/0.51	thf(c_0_30, plain, ![X41:$i, X40:mu, X39:mu]:((~(~(![X38:$i]:((~(a1 @ X41 @ X38)|~(likes @ X40 @ X39 @ X38)))))|(possibly_likes @ X40 @ X39 @ X41))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_user_communication_3]), c_0_24]), c_0_25]), c_0_18]), c_0_19])])).
0.21/0.51	thf(c_0_31, plain, ![X239:$i, X240:$i]:((~(a1 @ X239 @ X240)|(likes @ piotr @ beer @ X240))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_26])])).
0.21/0.51	thf(c_0_32, plain, ![X3:$i, X14:$i]:(((a1 @ X14 @ X3)|~((a1 @ X3 @ X14)))), inference(split_conjunct,[status(thm)],[c_0_27])).
0.21/0.51	thf(c_0_33, plain, ![X3:$i]:((a1 @ X3 @ (esk6_1 @ X3))), inference(split_conjunct,[status(thm)],[c_0_28])).
0.21/0.51	thf(c_0_34, plain, ((mexists_ind)=(^[Z0/* 19 */:mu > $i > $o, Z1:$i]:(~((![X22:mu]:((~((Z0 @ X22 @ Z1))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_29, c_0_15]), c_0_25])).
0.21/0.51	thf(c_0_35, plain, ![X151:$i, X152:mu, X153:mu, X154:$i]:((~(a1 @ X151 @ X154)|~(likes @ X152 @ X153 @ X154)|(possibly_likes @ X152 @ X153 @ X151))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])])).
0.21/0.51	thf(c_0_36, plain, ![X3:$i, X14:$i]:(((likes @ piotr @ beer @ X14)|~((a1 @ X3 @ X14)))), inference(split_conjunct,[status(thm)],[c_0_31])).
0.21/0.51	thf(c_0_37, plain, ![X3:$i]:((a1 @ (esk6_1 @ X3) @ X3)), inference(spm,[status(thm)],[c_0_32, c_0_33])).
0.21/0.51	thf(c_0_38, negated_conjecture, ~(![X64:$i]:(~(![X63:mu]:(~(~(![X62:mu]:(~(possibly_likes @ X63 @ X62 @ X64)))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]), c_0_34]), c_0_19])])).
0.21/0.51	thf(c_0_39, plain, ![X3:$i, X2:mu, X1:mu, X14:$i]:(((possibly_likes @ X1 @ X2 @ X3)|~((a1 @ X3 @ X14))|~((likes @ X1 @ X2 @ X14)))), inference(split_conjunct,[status(thm)],[c_0_35])).
0.21/0.51	thf(c_0_40, plain, ![X3:$i]:((likes @ piotr @ beer @ X3)), inference(spm,[status(thm)],[c_0_36, c_0_37])).
0.21/0.51	thf(c_0_41, negated_conjecture, ![X176:mu, X177:mu]:(~(possibly_likes @ X176 @ X177 @ esk2_0)), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])])])).
0.21/0.51	thf(c_0_42, plain, ![X3:$i, X14:$i]:(((possibly_likes @ piotr @ beer @ X3)|~((a1 @ X3 @ X14)))), inference(spm,[status(thm)],[c_0_39, c_0_40])).
0.21/0.51	thf(c_0_43, negated_conjecture, ![X1:mu, X2:mu]:(~((possibly_likes @ X1 @ X2 @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_41])).
0.21/0.51	thf(c_0_44, plain, ![X3:$i]:((possibly_likes @ piotr @ beer @ X3)), inference(spm,[status(thm)],[c_0_42, c_0_33])).
0.21/0.51	thf(c_0_45, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_43, c_0_44]), ['proof']).
0.21/0.51	# SZS output end CNFRefutation
0.21/0.51	# Parsed axioms                        : 118
0.21/0.51	# Removed by relevancy pruning/SinE    : 0
0.21/0.51	# Initial clauses                      : 91
0.21/0.51	# Removed in clause preprocessing      : 45
0.21/0.51	# Initial clauses in saturation        : 46
0.21/0.51	# Processed clauses                    : 102
0.21/0.51	# ...of these trivial                  : 0
0.21/0.51	# ...subsumed                          : 5
0.21/0.51	# ...remaining for further processing  : 97
0.21/0.51	# Other redundant clauses eliminated   : 0
0.21/0.51	# Clauses deleted for lack of memory   : 0
0.21/0.51	# Backward-subsumed                    : 0
0.21/0.51	# Backward-rewritten                   : 11
0.21/0.51	# Generated clauses                    : 114
0.21/0.51	# ...of the previous two non-redundant : 103
0.21/0.51	# ...aggressively subsumed             : 0
0.21/0.51	# Contextual simplify-reflections      : 0
0.21/0.51	# Paramodulations                      : 114
0.21/0.51	# Factorizations                       : 0
0.21/0.51	# NegExts                              : 0
0.21/0.51	# Equation resolutions                 : 0
0.21/0.51	# Disequality decompositions           : 0
0.21/0.51	# Total rewrite steps                  : 21
0.21/0.51	# ...of those cached                   : 6
0.21/0.51	# Propositional unsat checks           : 0
0.21/0.51	#    Propositional check models        : 0
0.21/0.51	#    Propositional check unsatisfiable : 0
0.21/0.51	#    Propositional clauses             : 0
0.21/0.51	#    Propositional clauses after purity: 0
0.21/0.51	#    Propositional unsat core size     : 0
0.21/0.51	#    Propositional preprocessing time  : 0.000
0.21/0.51	#    Propositional encoding time       : 0.000
0.21/0.51	#    Propositional solver time         : 0.000
0.21/0.51	#    Success case prop preproc time    : 0.000
0.21/0.51	#    Success case prop encoding time   : 0.000
0.21/0.51	#    Success case prop solver time     : 0.000
0.21/0.51	# Current number of processed clauses  : 42
0.21/0.51	#    Positive orientable unit clauses  : 16
0.21/0.51	#    Positive unorientable unit clauses: 0
0.21/0.51	#    Negative unit clauses             : 1
0.21/0.51	#    Non-unit-clauses                  : 25
0.21/0.51	# Current number of unprocessed clauses: 74
0.21/0.51	# ...number of literals in the above   : 179
0.21/0.51	# Current number of archived formulas  : 0
0.21/0.51	# Current number of archived clauses   : 55
0.21/0.51	# Clause-clause subsumption calls (NU) : 191
0.21/0.51	# Rec. Clause-clause subsumption calls : 112
0.21/0.51	# Non-unit clause-clause subsumptions  : 5
0.21/0.51	# Unit Clause-clause subsumption calls : 2
0.21/0.51	# Rewrite failures with RHS unbound    : 0
0.21/0.51	# BW rewrite match attempts            : 10
0.21/0.51	# BW rewrite match successes           : 9
0.21/0.51	# Condensation attempts                : 0
0.21/0.51	# Condensation successes               : 0
0.21/0.51	# Termbank termtop insertions          : 11368
0.21/0.51	# Search garbage collected termcells   : 3238
0.21/0.51	
0.21/0.51	# -------------------------------------------------
0.21/0.51	# User time                : 0.011 s
0.21/0.51	# System time              : 0.005 s
0.21/0.51	# Total time               : 0.016 s
0.21/0.51	# Maximum resident set size: 2560 pages
0.21/0.51	
0.21/0.51	# -------------------------------------------------
0.21/0.51	# User time                : 0.035 s
0.21/0.51	# System time              : 0.017 s
0.21/0.51	# Total time               : 0.052 s
0.21/0.51	# Maximum resident set size: 1828 pages
0.21/0.51	% E exiting
0.21/0.51	% E exiting
0.21/0.51	EOF